On the Computational Complexity of Embedding of Compressed Texts
نویسنده
چکیده
In this work we consider a well-known problem of processing of compressed texts. We study the following question (called Embedding): whether one compressed text is a subsequence of another compressed text? In this paper we show that Embedding is NPand co-NP-hard.
منابع مشابه
Querying and Embedding Compressed Texts
The computational complexity of two simple string problems on compressed input strings is considered: the querying problem (What is the symbol at a given position in a given input string?) and the embedding problem (Can the first input string be embedded into the second input string?). Straight-line programs are used for text compression. It is shown that the querying problem becomes P-complete...
متن کاملAn improved and efficient stenographic scheme based on matrix embedding using BCH syndrome coding.
This paper presents a new stenographic scheme based on matrix embedding using BCH syndrome coding. The proposed method embeds massage into cover by changing some coefficients of cover. In this paper defining a number :::as char:::acteristic of the syndrome, which is invariant with respect to the cyclic shift, we propose a new embedding algorithm base on BCH syndrome coding, without finding ro...
متن کاملSingular Value Decomposition based Steganography Technique for JPEG2000 Compressed Images
In this paper, a steganography technique for JPEG2000 compressed images using singular value decomposition in wavelet transform domain is proposed. In this technique, DWT is applied on the cover image to get wavelet coefficients and SVD is applied on these wavelet coefficients to get the singular values. Then secret data is embedded into these singular values using scaling factor. Different com...
متن کاملSyntactic Complexity of Russian Unified State Exam Texts in English: A Study on Reliability and Validity
In this study we analyze texts used in Russian Unified State Exam on English language. Texts that formed small research corpora were retrieved from 2 resources: official USE database as a reference point, and popular website used by pupils for USE training “Neznaika” (https://neznaika.pro/). The size of two corpora is balanced: USE has 11934 tokens and “Neznaika” - 11918 tokens. We share Biber’...
متن کاملEffects of Directional Subdividing on adaptive Grid-Embedding (RESEARCH NOTE)
The effects of using both directions and directional subdividing on adaptive gridembedding on the computational time and the number of grid points required for the same accuracy are considered. Directional subdividing is used from the beginning of the adaptation procedure without any restriction. To avoid the complication of unstructured grid, the semi-structured grid was used. It is used to so...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005